package gold.digger;

import gold.utils.InputUtil;
import gold.utils.UF;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

/**
 * Created by fanzhenyu02 on 2021/12/10.
 * common problem solver template.
 */
public class LCJZOF116 {
    public long startExecuteTime = System.currentTimeMillis();


    /**
     * Created by fanzhenyu02 on 2020/6/27.
     * Union Find 算法实现
     */
    public class UF {
        // 连通分量个数
        public int count;
        // 存储一棵树
        private int[] parent;
        // 记录树的“重量”
        private int[] size;

        public UF(int n) {
            this.count = n;
            parent = new int[n];
            size = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                size[i] = 1;
            }
        }

        /* 将 p 和 q 连接 */
        public void union(int p, int q) {
            int rootP = find(p);
            int rootQ = find(q);
            if (rootP == rootQ)
                return;

            // 小树接到大树下面，较平衡
            if (size[rootP] > size[rootQ]) {
                parent[rootQ] = rootP;
                size[rootP] += size[rootQ];
            } else {
                parent[rootP] = rootQ;
                size[rootQ] += size[rootP];
            }
            count--;
        }

        /* 判断 p 和 q 是否连通 */
        public boolean connected(int p, int q) {
            int rootP = find(p);
            int rootQ = find(q);
            return rootP == rootQ;
        }

        private int find(int x) {
            while (parent[x] != x) {
                // 进行路径压缩
                parent[x] = parent[parent[x]];
                x = parent[x];
            }
            return x;
        }

        /* 返回图中有多少个连通分量 */
        public int count() {
            return count;
        }

        /* 返回图中联通集合 */
        public Map<Integer, List<Integer>> outputAggregateSet(int n) {
            Map<Integer, List<Integer>> aggregateMap = new HashMap<>();

            // 共有n个集合
            for (int i = 0; i < n; i++) {
                int parentId = find(i);
                if (!aggregateMap.containsKey(parentId)) aggregateMap.put(parentId, new ArrayList<>());
                aggregateMap.get(parentId).add(i);
            }

            System.out.println(aggregateMap.toString());
            return aggregateMap;
        }
    }


    class Solution {

        public int findCircleNum(int[][] isConnected) {
            int size = isConnected.length;
            UF uf = new UF(size);
            for (int i = 0; i < size; i++) {
                for (int j = 0; j < size; j++) {
                    if (isConnected[i][j] == 1) {
                        uf.union(i, j);
                    }
                }
            }

            return uf.count;
        }
    }

    public void run() {
        System.out.println(new Solution().findCircleNum(InputUtil.toDoubleIntegerArray("[[1,1,0],[1,1,0],[0,0,1]]")));
        System.out.println(new Solution().findCircleNum(InputUtil.toDoubleIntegerArray("[[1,0,0],[0,1,0],[0,0,1]]")));
    }

    public static void main(String[] args) throws Exception {
        LCJZOF116 an = new LCJZOF116();
        an.run();

        System.out.println("\ncurrent solution total execute time: " + (System.currentTimeMillis() - an.startExecuteTime) + " ms.");
    }
}
